|
Knowledge compilation is a family of approaches for addressing the intractability of a number of artificial intelligence problems. A propositional model is compiled in an off-line phase in order to support some queries in polytime. Many ways of compiling a propositional models exist.〔Adnan Darwiche, Pierre Marquis, "(A Knowledge Compilation Map )", Journal of Artificial Intelligence Research 17 (2002) 229-264〕 Among others: NNF, DNNF, d-DNNF, BDD, SDD, MDD, DNF and CNF. Different compiled representations have different properties. The three main properties are: * The compactness of the representation * The queries that are supported in polytime * The transformations of the representations that can be performed in polytime == References == 〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「knowledge compilation」の詳細全文を読む スポンサード リンク
|